A near real-time evolutive strategy for adaptive Color Quantization of image sequences

نویسندگان

  • A. I. Gonzalez
  • M. Graña
  • F. X. Albizuri
  • A. d'Anjou
  • F. J. Torrealdea
چکیده

Color quantization of still images can be easily stated as a clustering problem. Color quantization of sequences of images becomes a non-stationary Clustering problem. In this paper we propose a very simple and effective evolutive strategy to perform adaptively the computation of the color representatives for each image in the sequence. Salient features of the evolutive strategy proposed here are: individuals correspond to individual cluster centres, to approach real-time response we impose one-generation adaptation for each image, mutation operators are guided by the actual covariance matrices of the clusters. Experimental results on a sequence of indoor images are presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutive Strategies for Adaptive Color Quantization

Color quantization of still images can be easily stated as a clustering problem. Color quantization of sequences of images becomes a non-stationary clustering problem. In this paper we propose a very simple and effective evolutive strategy to perform adaptively the computation of the color representatives for each image in the sequence. Salient features of the evolutive strategy proposed here a...

متن کامل

A Near Real-Time Evolution-Based Adaptation Strategy for Dynamic Color Quantization of Image Sequences

Color Quantization of still images can be easily stated as a Clustering problem. Color Quantization of sequences of images becomes a Non-stationary Clustering Problem. In this paper we propose a very simple and e€ective Evolution-based Adaptive Strategy to perform the adaptive computation of the color representatives for each image in the sequence. Salient features of the algorithm proposed her...

متن کامل

On the application of competitive neural networks to time-varying clustering problems

In this paper we consider the general statement of time varying clustering problems and the application of competitive neural networks to the fast search for time varying representatives. An experiment on the adaptive color quantization of image sequences within almost real time performance constraints has been conducted.

متن کامل

کاهش رنگ تصاویر با شبکه‌های عصبی خودسامانده چندمرحله‌ای و ویژگی‌های افزونه

Reducing the number of colors in an image while preserving its quality, is of importance in many applications such as image analysis and compression. It also decreases memory and transmission bandwidth requirements. Moreover, classification of image colors is applicable in image segmentation and object detection and separation, as well as producing pseudo-color images. In this paper, the Kohene...

متن کامل

Self organizing map for adaptive non-stationary clustering: some experimental results on color quantization of image sequences

In this paper we consider the application of the Self Organizing Map to the adaptive computation of cluster representatives (codevectors) over non-stationary data. The paradigm of Non-stationary Clustering is represented by the problem of Color Quantization of image sequences. Experimental results on the Color Quantization of an image sequence show the extreme robustness of the SOM as an adapti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997